Capacity-Achieving Guessing Random Additive Noise Decoding
نویسندگان
چکیده
منابع مشابه
Capacity-achieving decoding by guessing noise
We introduce a new algorithm for realizing Maximum Likelihood (ML) decoding in channels with memory. The algorithm is based on the principle that the receiver rank orders noise sequences from most likely to least likely. Subtracting noise from the received signal in that order, the first instance that results in an element of the code-book is the ML decoding. For channels where the noise is ind...
متن کاملCapacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملRandom Search under Additive Noise
From the early days in his career, Sid Yakowitz showed interest in noisy function optimization. He realized the universality of random search as an optimization paradigm, and was particularly interested in the minimization of functions Q without making assumptions on the form of Q. Especially the noisy optimization problem appealed to him, as exact computations of Q come often at a tremendous c...
متن کاملExplicit Capacity-achieving Codes for Worst-Case Additive Errors
For every p ∈ (0, 1/2), we give an explicit construction of binary codes of rate approaching “capacity” 1−H(p) that enable reliable communication in the presence of worst-case additive errors, caused by a channel oblivious to the codeword (but not necessarily the message). Formally, we give an efficient “stochastic” encoding E(·, ·) of messages combined with a small number of auxiliary random b...
متن کاملAchieving List Decoding Capacity Using Folded Reed-Solomon Codes
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R < 1 and ε > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 − R − ε) of errors. At least theoretically, this meets one of the cen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2896110